Finding shortest and dissimilar paths

The purpose of the dissimilar paths problem is to find a set paths, between same pair nodes, which share few arcs. has been addressed from an application point view, and integer programming formulations have also introduced recently. In present work, it assumed that each arc assigned with cost, goal then while simultaneously minimizing total cost. Some previous formulations: one number repeated arcs, another repetitions, as well modifications bound in arcs appear, are extended cost function. Properties resulting biobjective problems studied -constraint method adapted solve them using decreasing increasing strategy for updating . These methods tested finding sets 10 random grid instances assess efficiency performance calculate shortest paths. Results show repetitions produces efficient solutions higher dissimilarities faster than range similar both approaches. Additionally, bounding appears improves quality dissimilarity worsening its